A Parallel Computation Approach to Topological Sorting
نویسندگان
چکیده
منابع مشابه
A Parallel Computation Approach to Topological Sorting
A new topological sorting algorithm is formulated using the parallel computation approach. The time complexity of this algorithm is of the order of the longest distance between a source node and a sink node in an acyclic digraph representing the partial orderings between elements. An implementation of this algorithm with an SIMD machine is discussed. To avoid contention for logical resources, a...
متن کاملA Novel Approach to Parallel Sorting on Contemporary Architectures
We propose a parallel sorting algorithm that is better suited to today’s cluster based architectures. For large datasets, it turns out that a widely used algorithm such as sample sort might spend a considerable amount of time in the sampling phase. The sampling process itself requires “well chosen” parameters which yield “good samples”. Additionally, it requires an extra redistribution step at ...
متن کاملParallel Prefix Computation and Sorting on a Recursive Dual-Net
In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net RDN(B) for k > 0 has (2no)/2 nodes and d0 + k links per node, where n0 and d0 are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of ...
متن کاملAn Algebraic Approach to Parallel Association Computation
Association computation is a way of computing relevant (associated) information in one world by first mapping information to another world where relevant information is easer to compute and then reflecting the relevant information back to the original world. Although this computation mechanism has been successfully applied to realize GETA, a practical associative searching engine, it is far fro...
متن کاملRoomy: A New Approach to Parallel Disk-based Computation
Disk-based computation provides a major new application of disks in addition to the three traditional uses: file systems, databases, and virtual memory. Our working group has coined the term disk-based computation to describe our five year effort for using parallel disks in scientific computations. Disk-based computation makes use of the many disks already available in a computational cluster. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1983
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/26.4.293